Replication-based inference algorithms for hard computational problems
نویسندگان
چکیده
منابع مشابه
Replication-based inference algorithms for hard computational problems.
Inference algorithms based on evolving interactions between replicated solutions are introduced and analyzed on a prototypical NP-hard problem: the capacity of the binary Ising perceptron. The efficiency of the algorithm is examined numerically against that of the parallel tempering algorithm, showing improved performance in terms of the results obtained, computing requirements and simplicity o...
متن کاملAutomated Configuration of Algorithms for Solving Hard Computational Problems
The best-performing algorithms for many hard problems are highly parameterized. Selecting the best heuristics and tuning their parameters for optimal overall performance is often a difficult, tedious, and unsatisfying task. This thesis studies the automation of this important part of algorithm design: the configuration of discrete algorithm components and their continuous parameters to construc...
متن کاملHard Problems for CSP Algorithms
We prove exponential lower bounds on the running time of many algorithms for Constraint Satisfaction, by giving a simple family of instances on which they always take exponential time. Although similar lower bounds for most of these algorithms have been shown before, we provide a uniform treatment which illustrates a powerful general approach and has stronger impfications for the practice of al...
متن کاملExact algorithms based on specific complexity measures for hard problems
At present, most of the important computational problems—be they decision, search, or optimization problems—are known to satisfy one of the following two criteria: 1. The problem can be solved in polynomial time with respect to the input size n, where the degree of the polynomial is small enough to guarantee that the problem can be tackled efficiently in practice. In particular, the decision ve...
متن کاملApproximation algorithms for NP-hard optimization problems
In this chapter, we discuss approximation algorithms for optimization problems. An optimization problem consists in finding the best (cheapest, heaviest, etc.) element in a large set P, called the feasible region and usually specified implicitly, where the quality of elements of the set are evaluated using a function f(x), the objective function, usually something fairly simple. The element tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2013
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.88.013313